On Nonpreemptive LCFS Scheduling with Deadlines

On Nonpreemptive LCFS Scheduling with Deadlines

We investigate some real time behaviour of a (discrete time) single server system with nonpreemptive LCFS task scheduling . The main results deal with the probability distribution of a random variable SRD(T), which describes the time the system operates without any violation of a fixed task service time deadline T . A tree approach, similar to those already used for the derivation of the same q...

On Round-Robin routing with FCFS and LCFS scheduling

We study the Round-Robin (RR) routing to a system of parallel queues, which serve jobs according to FCFS or preemptive LCFS scheduling disciplines. The cost structure comprises two components: a service fee and a queueing delay related component. With Poisson arrivals, the inter-arrival time to each queue obeys the Erlang distribution. This allows us to study the mean and transient behavior of ...

Improved On-Line Broadcast Scheduling with Deadlines

We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the satisfied requests. For the case where all requested pages have the same length, we present an online deterministic algorithm named BAR and prove that it is 4.56-competitive. This improves the previous algorithm of Ki...

On-Line Scheduling with Tight Deadlines

On - line Scheduling with Hard Deadlines ( Extended

We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline , or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be sta...